math number theory *1400

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int main() {
  long long n;
  cin >> n;
  set<long long> fun;
  fun.insert(1);
  fun.insert(n * (n + 1) / 2);
  for (int k = 2; k * k <= n; k++) {
    if (n % k == 0) {
      long long m = n / k;
      long long t1 = m * (2 + (m - 1) * k) / 2;
      long long t2 = k * (2 + (k - 1) * m) / 2;
      fun.insert(t1);
      fun.insert(t2);
    }
  }
  for (auto val: fun) {
    cout << val << " ";
  }
  cout << endl;
  return 0;
}


Comments

Submit
0 Comments
More Questions

507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm